New and improved results for packing identical unitary radius circles within triangles, rectangles and strips
نویسندگان
چکیده
The focus of study in this paper is the class of packing problems. More specifically, it deals with the placement of a set of N circular items of unitary radius inside an object with the aim of minimizing its dimensions. Differently shaped containers are considered, namely circles, squares, rectangles, strips and triangles. By means of the resolution of nonlinear equations systems through the Newton-Raphson method, the herein presented algorithm succeeds in improving the accuracy of previous results attained by continuous optimization approaches up to numerical machine precision. The computer implementation and the data sets are available at http://www.ime.usp.br/~egbirgin/packing/.
منابع مشابه
A THEORETICALLY CORRECT RESOURCE USAGE VISUALIZATION FOR THE RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM
The cumulative resource constraints of the resource-constrained project scheduling problem (RCPSP) do not treat the resource demands as geometric rectangles, that is, activities are not necessarily assigned to the same resource units over their processing times. In spite of this fact, most papers on resource-constrained project scheduling mainly in the motivation phase use a strip packing of re...
متن کاملDense packing of congruent circles in free-form non-convex containers
This work proposes an algorithm for computing dense packings of congruent circles inside general 2D containers. Unlike the previous approaches which accept as containers, only simple, symmetric shapes such as circles, rectangles and triangles, our method works for any container with a general, freeform (spline) boundary. In contrast to most previous approaches which cast the problem into a non-...
متن کاملSplit Packing: An Algorithm for Packing Circles with up to Critical Density
In the classic circle packing problem, one asks whether a given set of circles can be packed into the unit square. This problem is known to be NP-hard. In this thesis, we present a new sufficient condition using only the circles’ combined area: It is possible to pack any circle instance with a combined area of up to ≈53.90% of the square’s area. This area condition is tight, in the sense that f...
متن کاملSymmetry-breaking constraints for packing identical rectangles within polyhedra
Two problems related to packing identical rectangles within a polyhedron are tackled in the present work. Rectangles are allowed to differ only by horizontal or vertical translations and possibly ninety-degree rotations. The first considered problem consists in packing as many identical rectangles as possible within a given polyhedron, while the second problem consists in finding the smallest p...
متن کاملA Proof of the Positive Density Conjecture for Integer Apollonian Circle Packings
In the first picture in Figure 1 there are three mutually tangent circles packed in a large circle on the outside, with four curvilinear triangles in-between. Such a configuration of circles is called a Descartes configuration and is the starting point for a bounded Apollonian circle packing (ACP). One may also consider an unbounded Apollonian circle packing in which the original Descartes conf...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & OR
دوره 37 شماره
صفحات -
تاریخ انتشار 2010